TSTP Solution File: NLP265^18 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : NLP265^18 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 09:41:02 EDT 2023
% Result : Theorem 0.21s 0.55s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NLP265^18 : TPTP v8.1.2. Released v8.1.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 24 11:27:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.49 %----Proving TH0
% 0.21/0.50 %------------------------------------------------------------------------------
% 0.21/0.50 % File : NLP265^18 : TPTP v8.1.2. Released v8.1.0.
% 0.21/0.50 % Domain : Natural Language Processing
% 0.21/0.50 % Problem : Schema instantiation example
% 0.21/0.50 % Version : [BP13] axioms.
% 0.21/0.50 % English : Alice intends Bob to believe that Portland is a big city.
% 0.21/0.50
% 0.21/0.50 % Refs : [BS96] Bretier & Sadek (1996), Rational Agent as the Kernel o
% 0.21/0.50 % : [RO12] Raths & Otten (2012), The QMLTP Problem Library for Fi
% 0.21/0.50 % : [BP13] Benzmueller & Paulson (2013), Quantified Multimodal Lo
% 0.21/0.50 % : [Ste22] Steen (2022), An Extensible Logic Embedding Tool for L
% 0.21/0.50 % Source : [TPTP]
% 0.21/0.50 % Names : MML014+1 [QMLTP]
% 0.21/0.50 % Status : Theorem
% 0.21/0.50 % Rating : 0.15 v8.1.0
% 0.21/0.50 % Syntax : Number of formulae : 35 ( 12 unt; 18 typ; 8 def)
% 0.21/0.50 % Number of atoms : 58 ( 8 equ; 0 cnn)
% 0.21/0.50 % Maximal formula atoms : 12 ( 3 avg)
% 0.21/0.50 % Number of connectives : 92 ( 1 ~; 1 |; 2 &; 85 @)
% 0.21/0.50 % ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% 0.21/0.50 % Maximal formula depth : 10 ( 4 avg)
% 0.21/0.50 % Number of types : 4 ( 2 usr)
% 0.21/0.50 % Number of type conns : 50 ( 50 >; 0 *; 0 +; 0 <<)
% 0.21/0.50 % Number of symbols : 17 ( 16 usr; 6 con; 0-3 aty)
% 0.21/0.50 % Number of variables : 31 ( 21 ^; 9 !; 1 ?; 31 :)
% 0.21/0.50 % SPC : TH0_THM_EQU_NAR
% 0.21/0.50
% 0.21/0.50 % Comments : This output was generated by embedproblem, version 1.7.1 (library
% 0.21/0.50 % version 1.3). Generated on Thu Apr 28 13:18:18 EDT 2022 using
% 0.21/0.50 % 'modal' embedding, version 1.5.2. Logic specification used:
% 0.21/0.50 % $modal == [$constants == $rigid,$quantification == $cumulative,
% 0.21/0.50 % $modalities == $modal_system_S5U].
% 0.21/0.50 %------------------------------------------------------------------------------
% 0.21/0.50 thf(mworld,type,
% 0.21/0.50 mworld: $tType ).
% 0.21/0.50
% 0.21/0.50 thf(mindex,type,
% 0.21/0.50 mindex: $tType ).
% 0.21/0.50
% 0.21/0.50 thf(mrel_type,type,
% 0.21/0.50 mrel: mindex > mworld > mworld > $o ).
% 0.21/0.50
% 0.21/0.50 thf('#i_alice_type',type,
% 0.21/0.50 '#i_alice': mindex ).
% 0.21/0.50
% 0.21/0.50 thf('#i_bob_type',type,
% 0.21/0.50 '#i_bob': mindex ).
% 0.21/0.50
% 0.21/0.50 thf('#b_alice_type',type,
% 0.21/0.50 '#b_alice': mindex ).
% 0.21/0.50
% 0.21/0.50 thf('#b_bob_type',type,
% 0.21/0.50 '#b_bob': mindex ).
% 0.21/0.50
% 0.21/0.50 thf(mactual_type,type,
% 0.21/0.50 mactual: mworld ).
% 0.21/0.50
% 0.21/0.50 thf(mlocal_type,type,
% 0.21/0.50 mlocal: ( mworld > $o ) > $o ).
% 0.21/0.50
% 0.21/0.50 thf(mlocal_def,definition,
% 0.21/0.50 ( mlocal
% 0.21/0.50 = ( ^ [Phi: mworld > $o] : ( Phi @ mactual ) ) ) ).
% 0.21/0.50
% 0.21/0.50 thf(mnot_type,type,
% 0.21/0.50 mnot: ( mworld > $o ) > mworld > $o ).
% 0.21/0.50
% 0.21/0.50 thf(mand_type,type,
% 0.21/0.50 mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.21/0.50
% 0.21/0.50 thf(mor_type,type,
% 0.21/0.50 mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.21/0.50
% 0.21/0.50 thf(mimplies_type,type,
% 0.21/0.50 mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.21/0.50
% 0.21/0.50 thf(mequiv_type,type,
% 0.21/0.50 mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.21/0.50
% 0.21/0.50 thf(mnot_def,definition,
% 0.21/0.50 ( mnot
% 0.21/0.50 = ( ^ [A: mworld > $o,W: mworld] :
% 0.21/0.50 ~ ( A @ W ) ) ) ).
% 0.21/0.50
% 0.21/0.50 thf(mand_def,definition,
% 0.21/0.50 ( mand
% 0.21/0.50 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.21/0.50 ( ( A @ W )
% 0.21/0.50 & ( B @ W ) ) ) ) ).
% 0.21/0.50
% 0.21/0.50 thf(mor_def,definition,
% 0.21/0.50 ( mor
% 0.21/0.50 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.21/0.50 ( ( A @ W )
% 0.21/0.50 | ( B @ W ) ) ) ) ).
% 0.21/0.50
% 0.21/0.50 thf(mimplies_def,definition,
% 0.21/0.50 ( mimplies
% 0.21/0.50 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.21/0.50 ( ( A @ W )
% 0.21/0.50 => ( B @ W ) ) ) ) ).
% 0.21/0.50
% 0.21/0.50 thf(mequiv_def,definition,
% 0.21/0.50 ( mequiv
% 0.21/0.50 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.21/0.50 ( ( A @ W )
% 0.21/0.50 <=> ( B @ W ) ) ) ) ).
% 0.21/0.50
% 0.21/0.50 thf(mbox_type,type,
% 0.21/0.50 mbox: mindex > ( mworld > $o ) > mworld > $o ).
% 0.21/0.50
% 0.21/0.50 thf(mbox_def,definition,
% 0.21/0.50 ( mbox
% 0.21/0.50 = ( ^ [R: mindex,Phi: mworld > $o,W: mworld] :
% 0.21/0.50 ! [V: mworld] :
% 0.21/0.50 ( ( mrel @ R @ W @ V )
% 0.21/0.50 => ( Phi @ V ) ) ) ) ).
% 0.21/0.50
% 0.21/0.50 thf(mdia_type,type,
% 0.21/0.50 mdia: mindex > ( mworld > $o ) > mworld > $o ).
% 0.21/0.50
% 0.21/0.50 thf(mdia_def,definition,
% 0.21/0.50 ( mdia
% 0.21/0.50 = ( ^ [R: mindex,Phi: mworld > $o,W: mworld] :
% 0.21/0.50 ? [V: mworld] :
% 0.21/0.50 ( ( mrel @ R @ W @ V )
% 0.21/0.50 & ( Phi @ V ) ) ) ) ).
% 0.21/0.50
% 0.21/0.50 thf('mrel_#i_alice_universal',axiom,
% 0.21/0.50 ! [W: mworld,V: mworld] : ( mrel @ '#i_alice' @ W @ V ) ).
% 0.21/0.51
% 0.21/0.51 thf('mrel_#i_bob_universal',axiom,
% 0.21/0.51 ! [W: mworld,V: mworld] : ( mrel @ '#i_bob' @ W @ V ) ).
% 0.21/0.51
% 0.21/0.51 thf('mrel_#b_alice_universal',axiom,
% 0.21/0.51 ! [W: mworld,V: mworld] : ( mrel @ '#b_alice' @ W @ V ) ).
% 0.21/0.51
% 0.21/0.51 thf('mrel_#b_bob_universal',axiom,
% 0.21/0.51 ! [W: mworld,V: mworld] : ( mrel @ '#b_bob' @ W @ V ) ).
% 0.21/0.51
% 0.21/0.51 thf(portland_decl,type,
% 0.21/0.51 portland: $i ).
% 0.21/0.51
% 0.21/0.51 thf(bigcity_decl,type,
% 0.21/0.51 bigcity: $i > mworld > $o ).
% 0.21/0.51
% 0.21/0.51 thf(axiom_1_alice,axiom,
% 0.21/0.51 mlocal @ ( mbox @ '#b_alice' @ ( mimplies @ ( mand @ ( bigcity @ portland ) @ ( mbox @ '#b_alice' @ ( mbox @ '#b_bob' @ ( mnot @ ( bigcity @ portland ) ) ) ) ) @ ( mbox @ '#i_alice' @ ( mbox @ '#b_bob' @ ( bigcity @ portland ) ) ) ) ) ).
% 0.21/0.51
% 0.21/0.51 thf(axiom_1_bob,axiom,
% 0.21/0.51 mlocal @ ( mbox @ '#b_bob' @ ( mimplies @ ( mand @ ( bigcity @ portland ) @ ( mbox @ '#b_bob' @ ( mbox @ '#b_alice' @ ( mnot @ ( bigcity @ portland ) ) ) ) ) @ ( mbox @ '#i_bob' @ ( mbox @ '#b_alice' @ ( bigcity @ portland ) ) ) ) ) ).
% 0.21/0.51
% 0.21/0.51 thf(axiom_2,axiom,
% 0.21/0.51 mlocal @ ( mbox @ '#b_alice' @ ( bigcity @ portland ) ) ).
% 0.21/0.51
% 0.21/0.51 thf(axiom_3,axiom,
% 0.21/0.51 mlocal @ ( mbox @ '#b_alice' @ ( mbox @ '#b_bob' @ ( mnot @ ( bigcity @ portland ) ) ) ) ).
% 0.21/0.51
% 0.21/0.51 thf(con,conjecture,
% 0.21/0.51 mlocal @ ( mbox @ '#i_alice' @ ( mbox @ '#b_bob' @ ( bigcity @ portland ) ) ) ).
% 0.21/0.51
% 0.21/0.51 %------------------------------------------------------------------------------
% 0.21/0.51 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.M8L4LApPr2/cvc5---1.0.5_4352.p...
% 0.21/0.51 (declare-sort $$unsorted 0)
% 0.21/0.51 (declare-sort tptp.mworld 0)
% 0.21/0.51 (declare-sort tptp.mindex 0)
% 0.21/0.51 (declare-fun tptp.mrel (tptp.mindex tptp.mworld tptp.mworld) Bool)
% 0.21/0.51 (declare-fun |tptp.'#i_alice'| () tptp.mindex)
% 0.21/0.51 (declare-fun |tptp.'#i_bob'| () tptp.mindex)
% 0.21/0.51 (declare-fun |tptp.'#b_alice'| () tptp.mindex)
% 0.21/0.51 (declare-fun |tptp.'#b_bob'| () tptp.mindex)
% 0.21/0.51 (declare-fun tptp.mactual () tptp.mworld)
% 0.21/0.51 (declare-fun tptp.mlocal ((-> tptp.mworld Bool)) Bool)
% 0.21/0.51 (assert (= tptp.mlocal (lambda ((Phi (-> tptp.mworld Bool))) (@ Phi tptp.mactual))))
% 0.21/0.51 (declare-fun tptp.mnot ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.21/0.51 (declare-fun tptp.mand ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.21/0.51 (declare-fun tptp.mor ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.21/0.51 (declare-fun tptp.mimplies ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.21/0.51 (declare-fun tptp.mequiv ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.21/0.51 (assert (= tptp.mnot (lambda ((A (-> tptp.mworld Bool)) (W tptp.mworld)) (not (@ A W)))))
% 0.21/0.51 (assert (= tptp.mand (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (and (@ A W) (@ B W)))))
% 0.21/0.51 (assert (= tptp.mor (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (or (@ A W) (@ B W)))))
% 0.21/0.51 (assert (= tptp.mimplies (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (=> (@ A W) (@ B W)))))
% 0.21/0.51 (assert (= tptp.mequiv (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (= (@ A W) (@ B W)))))
% 0.21/0.51 (declare-fun tptp.mbox (tptp.mindex (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.21/0.51 (assert (= tptp.mbox (lambda ((R tptp.mindex) (Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (forall ((V tptp.mworld)) (=> (@ (@ (@ tptp.mrel R) W) V) (@ Phi V))))))
% 0.21/0.51 (declare-fun tptp.mdia (tptp.mindex (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.21/0.51 (assert (= tptp.mdia (lambda ((R tptp.mindex) (Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (exists ((V tptp.mworld)) (and (@ (@ (@ tptp.mrel R) W) V) (@ Phi V))))))
% 0.21/0.51 (assert (forall ((W tptp.mworld) (V tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#i_alice'|) W) V)))
% 0.21/0.51 (assert (forall ((W tptp.mworld) (V tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#i_bob'|) W) V)))
% 0.21/0.51 (assert (forall ((W tptp.mworld) (V tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#b_alice'|) W) V)))
% 0.21/0.51 (assert (forall ((W tptp.mworld) (V tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#b_bob'|) W) V)))
% 0.21/0.51 (declare-fun tptp.portland () $$unsorted)
% 0.21/0.51 (declare-fun tptp.bigcity ($$unsorted tptp.mworld) Bool)
% 0.21/0.51 (assert (let ((_let_1 (@ tptp.bigcity tptp.portland))) (let ((_let_2 (@ tptp.mbox |tptp.'#b_bob'|))) (let ((_let_3 (@ tptp.mbox |tptp.'#b_alice'|))) (@ tptp.mlocal (@ _let_3 (@ (@ tptp.mimplies (@ (@ tptp.mand _let_1) (@ _let_3 (@ _let_2 (@ tptp.mnot _let_1))))) (@ (@ tptp.mbox |tptp.'#i_alice'|) (@ _let_2 _let_1)))))))))
% 0.21/0.55 (assert (let ((_let_1 (@ tptp.bigcity tptp.portland))) (let ((_let_2 (@ tptp.mbox |tptp.'#b_alice'|))) (let ((_let_3 (@ tptp.mbox |tptp.'#b_bob'|))) (@ tptp.mlocal (@ _let_3 (@ (@ tptp.mimplies (@ (@ tptp.mand _let_1) (@ _let_3 (@ _let_2 (@ tptp.mnot _let_1))))) (@ (@ tptp.mbox |tptp.'#i_bob'|) (@ _let_2 _let_1)))))))))
% 0.21/0.55 (assert (@ tptp.mlocal (@ (@ tptp.mbox |tptp.'#b_alice'|) (@ tptp.bigcity tptp.portland))))
% 0.21/0.55 (assert (@ tptp.mlocal (@ (@ tptp.mbox |tptp.'#b_alice'|) (@ (@ tptp.mbox |tptp.'#b_bob'|) (@ tptp.mnot (@ tptp.bigcity tptp.portland))))))
% 0.21/0.55 (assert (not (@ tptp.mlocal (@ (@ tptp.mbox |tptp.'#i_alice'|) (@ (@ tptp.mbox |tptp.'#b_bob'|) (@ tptp.bigcity tptp.portland))))))
% 0.21/0.55 (set-info :filename cvc5---1.0.5_4352)
% 0.21/0.55 (check-sat-assuming ( true ))
% 0.21/0.55 ------- get file name : TPTP file name is NLP265^18
% 0.21/0.55 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_4352.smt2...
% 0.21/0.55 --- Run --ho-elim --full-saturate-quant at 10...
% 0.21/0.55 % SZS status Theorem for NLP265^18
% 0.21/0.55 % SZS output start Proof for NLP265^18
% 0.21/0.55 (
% 0.21/0.55 (let ((_let_1 (@ tptp.bigcity tptp.portland))) (let ((_let_2 (@ tptp.mbox |tptp.'#b_bob'|))) (let ((_let_3 (@ (@ tptp.mbox |tptp.'#i_alice'|) (@ _let_2 _let_1)))) (let ((_let_4 (not (@ tptp.mlocal _let_3)))) (let ((_let_5 (@ tptp.mnot _let_1))) (let ((_let_6 (@ tptp.mbox |tptp.'#b_alice'|))) (let ((_let_7 (@ _let_6 (@ _let_2 _let_5)))) (let ((_let_8 (@ _let_6 _let_1))) (let ((_let_9 (@ tptp.mlocal _let_8))) (let ((_let_10 (@ tptp.mand _let_1))) (let ((_let_11 (forall ((W tptp.mworld) (V tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#b_alice'|) W) V)))) (let ((_let_12 (= tptp.mdia (lambda ((R tptp.mindex) (Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (exists ((V tptp.mworld)) (and (@ (@ (@ tptp.mrel R) W) V) (@ Phi V))))))) (let ((_let_13 (= tptp.mbox (lambda ((R tptp.mindex) (Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (forall ((V tptp.mworld)) (=> (@ (@ (@ tptp.mrel R) W) V) (@ Phi V))))))) (let ((_let_14 (= tptp.mequiv (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (= (@ A W) (@ B W)))))) (let ((_let_15 (= tptp.mimplies (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (=> (@ A W) (@ B W)))))) (let ((_let_16 (= tptp.mor (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (or (@ A W) (@ B W)))))) (let ((_let_17 (= tptp.mand (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (and (@ A W) (@ B W)))))) (let ((_let_18 (= tptp.mnot (lambda ((A (-> tptp.mworld Bool)) (W tptp.mworld)) (not (@ A W)))))) (let ((_let_19 (= tptp.mlocal (lambda ((Phi (-> tptp.mworld Bool))) (@ Phi tptp.mactual))))) (let ((_let_20 (forall ((W tptp.mworld) (V tptp.mworld)) (ho_5 (ho_4 (ho_3 k_2 |tptp.'#b_alice'|) W) V)))) (let ((_let_21 (ho_5 (ho_4 (ho_3 k_2 |tptp.'#b_alice'|) tptp.mactual) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8))) (let ((_let_22 (EQ_RESOLVE (ASSUME :args (_let_11)) (PREPROCESS :args ((= _let_11 _let_20)))))) (let ((_let_23 (ho_7 k_6 tptp.portland))) (let ((_let_24 (ho_5 _let_23 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8))) (let ((_let_25 (not _let_21))) (let ((_let_26 (or _let_25 _let_24))) (let ((_let_27 (forall ((V tptp.mworld)) (or (not (ho_5 (ho_4 (ho_3 k_2 |tptp.'#b_alice'|) tptp.mactual) V)) (ho_5 (ho_7 k_6 tptp.portland) V))))) (let ((_let_28 (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_12)) (MACRO_SR_EQ_INTRO :args (_let_12 SB_DEFAULT SBA_FIXPOINT))) (EQ_RESOLVE (ASSUME :args (_let_13)) (MACRO_SR_EQ_INTRO :args (_let_13 SB_DEFAULT SBA_FIXPOINT))) (ASSUME :args (_let_14)) (ASSUME :args (_let_15)) (ASSUME :args (_let_16)) (ASSUME :args (_let_17)) (ASSUME :args (_let_18)) (ASSUME :args (_let_19))))) (let ((_let_29 (EQ_RESOLVE (ASSUME :args (_let_9)) (TRANS (MACRO_SR_EQ_INTRO _let_28 :args (_let_9 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((V tptp.mworld)) (or (not (@ (@ (@ tptp.mrel |tptp.'#b_alice'|) tptp.mactual) V)) (@ (@ tptp.bigcity tptp.portland) V))) _let_27))))))) (let ((_let_30 (or (not (ho_5 (ho_4 (ho_3 k_2 |tptp.'#b_bob'|) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8)) _let_24))) (let ((_let_31 (forall ((BOUND_VARIABLE_885 tptp.mworld)) (or (not (ho_5 (ho_4 (ho_3 k_2 |tptp.'#b_bob'|) BOUND_VARIABLE_885) BOUND_VARIABLE_885)) (ho_5 (ho_7 k_6 tptp.portland) BOUND_VARIABLE_885))))) (let ((_let_32 (not _let_30))) (let ((_let_33 (not _let_31))) (let ((_let_34 (_let_33))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_22 :args (tptp.mactual SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8 QUANTIFIERS_INST_CBQI_CONFLICT)) :args (_let_20))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_26)) :args ((or _let_24 _let_25 (not _let_26)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_30 1)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_34)) :args _let_34)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_33) _let_31))) (REFL :args (_let_32)) :args (or))) (NOT_OR_ELIM (EQ_RESOLVE (ASSUME :args (_let_4)) (TRANS (MACRO_SR_EQ_INTRO _let_28 :args (_let_4 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (or (forall ((BOUND_VARIABLE_885 tptp.mworld)) (or (not (@ (@ (@ tptp.mrel |tptp.'#b_bob'|) BOUND_VARIABLE_885) BOUND_VARIABLE_885)) (@ (@ tptp.bigcity tptp.portland) BOUND_VARIABLE_885))) (forall ((V tptp.mworld)) (not (@ (@ (@ tptp.mrel |tptp.'#i_alice'|) tptp.mactual) V))))) (not (or _let_31 (forall ((V tptp.mworld)) (not (ho_5 (ho_4 (ho_3 k_2 |tptp.'#i_alice'|) tptp.mactual) V)))))))))) :args (0)) :args (_let_32 true _let_31)) :args ((not _let_24) true _let_30)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_29 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_8 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (ho_5 _let_23 V) true))))) :args (_let_27))) _let_29 :args (_let_26 false _let_27)) :args (_let_25 true _let_24 false _let_26)) _let_22 :args (false true _let_21 false _let_20)) :args (_let_19 _let_18 _let_17 _let_16 _let_15 _let_14 _let_13 _let_12 (forall ((W tptp.mworld) (V tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#i_alice'|) W) V)) (forall ((W tptp.mworld) (V tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#i_bob'|) W) V)) _let_11 (forall ((W tptp.mworld) (V tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#b_bob'|) W) V)) (@ tptp.mlocal (@ _let_6 (@ (@ tptp.mimplies (@ _let_10 _let_7)) _let_3))) (@ tptp.mlocal (@ _let_2 (@ (@ tptp.mimplies (@ _let_10 (@ _let_2 (@ _let_6 _let_5)))) (@ (@ tptp.mbox |tptp.'#i_bob'|) _let_8)))) _let_9 (@ tptp.mlocal _let_7) _let_4 true)))))))))))))))))))))))))))))))))))))
% 0.21/0.55 )
% 0.21/0.55 % SZS output end Proof for NLP265^18
% 0.21/0.55 % cvc5---1.0.5 exiting
% 0.21/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------